Benchmark Fitness Landscape Analysis
نویسندگان
چکیده
Various techniques of fitness landscape analysis for the determination of optimisation problem hardness for evolutionary algorithms are proposed in the literature. However, a few implementations of these techniques and their application in practice are described nowadays. In the paper comparative statistical and information analysis for benchmark fitness functions such as Sphere, Rastrigin, Rosenbrock and Ackley functions is performed. Both statistical and information measures for benchmark fitness landscapes are estimated and interpreted in the optimisation context. The sensitivity analysis is performed to determine how the conditions of experimental analysis and the noise factor will impact the target measures and their estimations.
منابع مشابه
An iterative local search approach based on fitness landscapes analysis for the delay-constrained multicast routing problem
This paper presents the first fitness landscape analysis on the delay-constrained least-cost multicast routing problem (DCLC-MRP), a well-known NP-hard problem. Although the problem has attracted an increasing research attention over the past decade in telecommunications and operational research, little research has been conducted to analyze the features of its underlying landscape. Two of the ...
متن کاملLocal Landscape Patterns for Fitness Landscape Analysis
Almost all problems targeted by evolutionary computation are black-box or heavily complex, and their fitness landscapes usually are unknown. Selection of the appropriate search algorithm and parameters is a crucial topic when the landscape of a given target problem could be unknown in advance. Although several landscape features have been proposed in this context, examining a variety of landsca...
متن کاملFitness Landscape Analysis of Circles in a Square Packing Problems
Fitness landscape analysis provides insight into the structural features of optimization problems. Landscape analysis techniques have been individually shown to capture specific continuous landscape features. However, results are typically for benchmark and artificial problems, and so the ability of techniques to capture real-world problem structures remains largely unknown. In this paper we ex...
متن کاملAnalysis of fitness landscape modifications in evolutionary dynamic optimization
In this work, discrete dynamic optimization problems (DOPs) are theoretically analysed according to the modifications produced in the fitness landscape during the optimization process. Using the proposed analysis framework, the following DOPs are analysed: problems generated by the XOR DOP generator, three versions of the dynamic 0–1 knapsack problem, one problem involving evolutionary robots i...
متن کاملMultiobjective Fitness Landscape Analysis and the Design of Effective Memetic
J. Deon Garrett. Ph.D. The University of Memphis. February, 2008. Multiobjective Fitness Landscape Analysis and the Design of Effective Memetic Algorithms. Major Professor: Dipankar Dasgupta, Ph.D. For a wide variety of combinatorial optimization problems, no efficient algorithms exist to exactly solve the problem unless P=NP. For these problems, metaheuristics have come to dominate the landsca...
متن کامل